The Computational Difficulty of ID/LP Parsing
نویسنده
چکیده
\lodern linguistic theory attributes surface complexity to interacting snbsystems of constraints. ["or instance, the ID LP gr,'unmar formalism separates constraints on immediate dominance from those on linear order. 5hieber's (t983) ID/I.P parsing algorithm shows how to use ID and LP constraints directly in language processing , without expandiqg them into an intcrmrdiate "object gammar." However, Shieber's purported O(:,Gi 2 .n ~) run-time bound underestimates the tlillicnlty of ID/LP parsing. ID/LP parsing is actually NP-complete, anti the worst-case runtime of Shieber's algorithm is actually exponential in grammar size. The growth of parser data structures causes the difficulty. So)tie ct)mputational and linguistic implications follow: in particular, it is important to note that despite its poteutial for combinatorial explosion, Shieber's algorithm remains better thau the alternative of parsing an expanded object gr~anmar.
منابع مشابه
On The Complexity Of ID/LP Parsing
Modern linguistic theory attributes surface complexity to interacting subsystems of constraints. For instance, the ID/LP grammar formalism separates constraints on immediate dominance from those on linear order. An ID/LP parsing algorithm by Shieber shows how to use ID and LP constraints directly in language processing, without expanding them into an intermediate context-free "object grammar". ...
متن کاملParsing with ID/LP and PS Rules
Unspecified Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: http://doi.org/10.5167/uzh-19151 Originally published at: Volk, M (1996). Parsing with ID/LP and PS rules. In: Natural Language Processing and Speech Technology. Results of the 3rd KONVENS Conference (Bielefeld), Berlin, 1996 1996, 342-353. Parsing with ID/LPand PS-rules Published in \Proceedings of the...
متن کاملA Chart-based Method of ID/LP Parsing with Generalized Discrimination Networks
Variations of word order are among the most well-known phenomena of natural languages. From st well represented sample of world languages, Steele[13] shows that about 76% of languages exhibit significant word order variation. In addition to the wellknown Walpiri(Australian language), several languages such as Japanese, Thai, German, Hindi, and Finnish also allow considerable word order variatio...
متن کاملThe Complexity of Recognition of Linguistically Adequate Dependency Grammars
Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of ID/LP-grammars to the dependency framework. Contrary to previous studies on heavily restricted dependency grammars, we prove that recognition (and thus, parsing) of li...
متن کامل